Refinement of the Four-Dimensional GLV Method on Elliptic Curves
نویسندگان
چکیده
All sessions will take place in room DMS 1110 in the Desmarais Building Monday, August 14, 2017 08:30 – 09:10 Registration (in the main floor lobby of the Desmarais Building) 09:10 – 09:15 Opening Remarks Full-day session: Introduction to Post-Quantum Cryptography Michele Mosca, Douglas Stebila, David Jao 09:15 10:30 Post-Quantum Cryptography Session 1 10:30 11:00 Coffee/Nutrition Break 11:00 12:15 Post-Quantum Cryptography Session 2 12:15 13:45 Lunch (various options on campus and at nearby downtown locations) 13:45 15:00 Post-Quantum Cryptography Session 3 15:00 15:30 Coffee/Nutrition Break 15:30 16:45 Post-Quantum Cryptography Session 4
منابع مشابه
Four-Dimensional GLV via the Weil Restriction
The Gallant-Lambert-Vanstone (GLV) algorithm uses efficiently computable endomorphisms to accelerate the computation of scalar multiplication of points on an abelian variety. Freeman and Satoh proposed for cryptographic use two families of genus 2 curves defined over Fp which have the property that the corresponding Jacobians are (2, 2)isogenous over an extension field to a product of elliptic ...
متن کاملImplementing 4-Dimensional GLV Method on GLS Elliptic Curves with j-Invariant 0
The Gallant-Lambert-Vanstone (GLV) method is a very efcient technique for accelerating point multiplication on elliptic curves with e ciently computable endomorphisms. Galbraith, Lin and Scott (J. Cryptol. 24(3), 446-469 (2011)) showed that point multiplication exploiting the 2-dimensional GLV method on a large class of curves over Fp2 was faster than the standard method on general elliptic cur...
متن کاملImplementing the 4-dimensional GLV method on GLS elliptic curves with j-invariant 0
The Gallant-Lambert-Vanstone (GLV) method is a very efcient technique for accelerating point multiplication on elliptic curves with e ciently computable endomorphisms. Galbraith, Lin and Scott (J. Cryptol. 24(3), 446-469 (2010)) showed that point multiplication exploiting the 2-dimensional GLV method on a large class of curves over Fp2 was faster than the standard method on general elliptic cur...
متن کاملFaster Software for Fast Endomorphisms
GLV curves (Gallant et al.) have performance advantages over standard elliptic curves, using half the number of point doublings for scalar multiplication. Despite their introduction in 2001, implementations of the GLV method have yet to permeate widespread software libraries. Furthermore, side-channel vulnerabilities, specifically cachetiming attacks, remain unpatched in the OpenSSL code base s...
متن کاملEfficient and Secure Algorithms for GLV-Based Scalar Multiplication and Their Implementation on GLV-GLS Curves
We propose efficient algorithms and formulas that improve the performance of side-channel protected elliptic curve computations, with special focus on scalar multiplication exploiting the GallantLambert-Vanstone (CRYPTO 2001) and Galbraith-Lin-Scott (EUROCRYPT 2009) methods. Firstly, by adapting Feng et al.’s recoding to the GLV setting, we derive new regular algorithms for variable-base scalar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017